package j2025.j05;

/**
 * @Author 猫大仙
 */
public class j0517 {
    public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while(left<right){
            int mid = left + (right-left)/2;
            if(target>nums[mid]){
                left = mid + 1;
            }else {
                right = mid;
            }
        }
        if(nums[left]<target){
            return left+1;
        }
        return left;
    }
}
